Chemistry on Quantum Computers with Virtual Quantum Subspace Expansion
نویسندگان
چکیده
منابع مشابه
Simulating chemistry using quantum computers.
The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, no...
متن کاملSimulating Quantum Chaos with Quantum Computers
We study the e ect of quantum non-integrability in quantum computation. A quantum Hamiltonian H = 1 2 (p 2 x + p 2 y + x 2 y 2 ) whose classical counterpart is known to be non-integrable is considered as a candidate of quantum non-integrable Hamiltonian using the Weyl rule. Our analysis illustrates a relation between quantum computability and quantum integrability, whose classical limit corresp...
متن کاملQuantum Gravity on Computers
Some times Thomas Hardy has been compared to Dostoevski, but Dostoevski is an incomparably ner artist. If Dostoevski's works could be compared to some of say, Rubens' paintings, then Hardy's are neatly nished diagrams drawn on graph paper with ruler and compass! Compare for instance the tragedy to Tess with that of Sonia, or the culmination of the forces in Raskolnikoo's confession with the mel...
متن کاملGate count estimates for performing quantum chemistry on small quantum computers
As quantum computing technology improves and quantum computers with a small but non-trivial number of N ≥ 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman’s original proposal of simulating quantum systems, and in particular the electronic structure of molecules and mat...
متن کاملQuantum Walks, Quantum Gates, and Quantum Computers
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a singleand multi-excitation coding, and for more genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Theory and Computation
سال: 2020
ISSN: 1549-9618,1549-9626
DOI: 10.1021/acs.jctc.0c00447